Verifiable Random Functions
نویسندگان
چکیده
We efficiently combine unpredictability and verifiability by extending the Goldreich–Goldwasser–Micali construction of pseudorandom functions fs from a secret seed s, so that knowledge of s not only enables one to evaluate fs at any point x, but also to provide an NP-proof that the value fs(x) is indeed correct without compromising the unpredictability of fs at any other point for which no such a proof was provided.
منابع مشابه
Verifiable Random Functions from Standard Assumptions
The question whether there exist verifiable random functions with exponential-sized input space and full adaptive security based on a non-interactive, constant-size assumption is a longstanding open problem. We construct the first verifiable random functions which achieve all these properties simultaneously. Our construction can securely be instantiated in groups with symmetric bilinear map, ba...
متن کاملAdaptive-Secure VRFs with Shorter Keys from Static Assumptions
Verifiable random functions are pseudorandom functions producing publicly verifiable proofs for their outputs, allowing for efficient checks of the correctness of their computation. In this work, we introduce a new computational hypothesis, the n-Eigen-Value assumption, which can be seen as a relaxation of the Un MDDH assumption, and prove its equivalence with the n-Rank assumption. Based on th...
متن کاملUnique Aggregate Signatures with Applications to Distributed Verifiable Random Functions
The computation process of a Distributed Verifiable Random Function (DVRF) on some input specified by the user involves multiple, possibly malicious servers, and results in a publicly verifiable pseudorandom output to the user. Previous DVRF constructions assumed trusted generation of secret keys for the servers and imposed a threshold on the number of corrupted servers. In this paper we propos...
متن کاملEfficient Construction of (Distributed) Verifiable Random Functions
We give the first simple and efficient construction of verifiable random functions (VRFs). VRFs, introduced by Micali et al. [MRV99], combine the properties of regular pseudorandom functions (PRFs) [GGM86] (i.e., indistinguishability from a random function) and digital signatures [GMR88] (i.e., one can provide an unforgeable proof that the VRF value is correctly computed). The efficiency of our...
متن کاملInstance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [23] with a special public key, which is generated via a (possibly)interactive protocol and contains an instance y ∈ L ∩ {0, 1}∗ for a specific NP language L, but the security requirements on such a function are relaxed: we only...
متن کاملVerifiable Random Functions from Weaker Assumptions
The construction of a verifiable random function (VRF) with large input space and full adaptive security from a static, non-interactive complexity assumption, like decisional Diffie-Hellman, has proven to be a challenging task. To date it is not even clear that such a VRF exists. Most known constructions either allow only a small input space of polynomially-bounded size, or do not achieve full ...
متن کامل